منابع مشابه
Convolution without independence
Widely used convolutions and deconvolutions techniques traditionally rely on the assumption of independence, an assumption often criticized as being very strong. We observe that independence is, in fact, not necessary for the convolution theorem to hold. Instead, a much weaker notion, known as subindependence, is the appropriate necessary and sufficient condition. We motivate the usefulness of ...
متن کاملEfficient Convolution Without Latency
It is well known that a block FFT implementation of convolution is vastly more efficient than the direct form FIR filter. Unfortunately, block processing incurs significant input/output latency which is undesirable for real-time applications. A hybrid method is proposed for doing convolution by combining direct form and block FFT processing. The result is a zero latency convolver that performs ...
متن کاملEquilibrium without Independence *
Because players whose preferences violate the von Neumann-Morgenstern independence axiom may be unwilling to randomize as mixed-strategy Nash equilibrium would require, a Nash equilibrium may not exist without independence. This paper generalizes Nash’s definition of equilibrium, retaining its rationalexpectations spirit but relaxing its requirement that a player must bear as much uncertainty a...
متن کاملFairness and Utilitarianism without Independence
In this work we reconsider Harsanyis celebrated (1953, 1955, 1977) utilitarian impartial observer theorem. Departing from Harsanyis individual-centered approach, we argue that, when societal decisions are at stake, postulates must not be drawn from individualistic behavior. Rather, they should be based on societal norms. Hence, notions like societal fairness should explicitly be taken as the ...
متن کاملIndependence clustering (without a matrix)
The independence clustering problem is considered in the following formulation: given a set S of random variables, it is required to find the finest partitioning {U1, . . . , Uk} of S into clusters such that the clusters U1, . . . , Uk are mutually independent. Since mutual independence is the target, pairwise similarity measurements are of no use, and thus traditional clustering algorithms are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Econometrics
سال: 2019
ISSN: 0304-4076
DOI: 10.1016/j.jeconom.2018.12.018